Further comparison of additive and multiplicative coarse grid correction
نویسندگان
چکیده
Article history: Received 1 February 2012 Received in revised form 26 November 2012 Accepted 1 December 2012 Available online 5 December 2012
منابع مشابه
Overlapping Additive and Multiplicative Schwarz Iterations for H-matrices
In recent years, an algebraic framework was introduced for the analysis of convergence of Schwarz methods for the solution of linear systems of the form Ax = b. Within this framework, additive and multiplicative Schwarz were shown to converge when the coefficient matrix A is a nonsingular M -matrix, or a symmetric positive definite matrix. In this paper, these results are extended to the case o...
متن کاملA comparison of abstract versions of deflation, balancing and additive coarse grid correction preconditioners
In this paper we consider various preconditioners for the cg method to solve large linear systems of equations with symmetric positive definite system matrix. We continue the comparison between abstract versions of the deflation, balancing and additive coarse grid correction preconditioning techniques started in [17, 18]. There the deflation method is compared with the abstract additive coarse ...
متن کاملA Coarse Grid Space Construction Based on Local DtN Maps
Coarse grid correction is a key ingredient in order to have scalable domain decomposition methods. In this work we construct the coarse grid space using the low frequency modes of the subdomain DtN maps, and apply the obtained two-level preconditioner (the additive Schwarz method together with the new coarse grid) to the extended or the original linear system arising from an overlapping domain ...
متن کاملAdditive and Multiplicative Two-Level Spectral Preconditioning for General Linear Systems
Multigrid methods are among the fastest techniques to solve linear systems arising from the discretization of partial differential equations. The core of the multigrid algorithms is a two-grid procedure that is applied recursively. A two-grid method can be fully defined by the smoother that is applied on the fine grid, the coarse grid and the grid transfer operators to move between the fine and...
متن کاملDomain Decomposition Methods and Deflated Krylov Subspace Iterations
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are fast and successful preconditioners within domain decomposition methods for solving partial differential equations. For certain elliptic problems these preconditioners lead to condition numbers which are independent of the mesh sizes and are independent of jumps in the coefficients (BNN). Here w...
متن کامل